Mr. D. W. Amos, M.B.E.

W. R. D. Fairbairn

The Late Mr. John W. Davies

Mr. Navin D. Jambhekar

The Internet is full of insecure links; therefore the information on the Internet is not secure. Protecting the static or flowing information on the Internet from misuse or hacking is the prime goal. Some solution to be discussed is how to passing information in a manner that the very existence of the message is unknown in order to repel attention of the potential attacker. Besides hiding data ...

Proof Labeling Schemes ∗ Amos Korman

This paper addresses the problem of locally verifying global properties. Several natural questions are studied, such as “how expensive is local verification?” and more specifically “how expensive is local verification compared to computation?” A suitable model is introduced in which these questions are studied in terms of the number of bits a node needs to communicate. In addition, approaches a...

Competitive Paging Algorithms AMOS FIAT

The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimize the number of page faults. We develop the marking algorithm, a randomized on-line algorithm for the paging problem. We prove that its expected cost on any sequence of requests is within a factor of 2Hk of optimum. (Where Hk is the kth harmonic number, which is roughly Ink.) The best such facto...